Description: 对于高频的电路设计，就必须要考虑阻抗匹配的问题，否则信号的质量和传输距离就会受到严重影响，本文介绍了如何理解阻抗匹配的问题，是难得得资料。-For high-frequency circuit design, it is necessary to consider the problem of impedance matching, or the quality of the signal and the transmission distance can be severely affected, this article describes how to understand impedance matching is rare information. Platform: |
Size: 7168 |
Author:ievance |
Hits:
Description: 字符串的模式匹配，使用KMP算法解决优化字符串的模式匹配问题。-String pattern matching, using the KMP algorithm to solve the optimization of the string pattern matching problem. Platform: |
Size: 9242624 |
Author: |
Hits:
Description: 匈牙利算法的matlab程序，用于解决最大匹配等问题-Hungarian algorithm matlab program for solving the maximum matching problem Platform: |
Size: 3072 |
Author:良辰 |
Hits:
Description: 数字滤波算法：基于L*MAD准则的中值数决策滤波器。数字滤波器是用软件实现的，不需要增加硬设备，因而可靠性高、稳定性好，不存在阻抗匹配问题。-Digital filtering algorithm: Based on the L* MAD guidelines median number of decisions filter. The digital filter is implemented in software, no additional hardware devices, and thus high reliability, good stability, there is no impedance matching problem. Platform: |
Size: 197632 |
Author:bliens |
Hits:
Description: 圆括号匹配问题。(1) 圆括号包括“(), [], {}”三对；
(2) 要用到栈来进行匹配，遇到左括号进栈，遇到右括号弹栈进行匹配判断；-Parenthesis matching problem. (1) the parentheses including (), [], {} three of
(2) to use the stack to the match, encounter left bracket into the stack, the stack met right parenthesis matching judgment Platform: |
Size: 14336 |
Author:zy |
Hits:
Description: 图像匹配是图像处理的基本问题，同时也一个难点，本代码是基于直线描述子的场景匹配。-Line segment matching plays an important role in image processing and computer vision, while it remains a challenging task for images under various transformations. In this work, we present a line matching algorithm which considers both the local appearance of lines and their geometric attributes. To overcome the problem of segment fragmentation and geometric variation, we extract lines in the scale space. To depict the local appearance of lines, we design a novel line descriptor called as Line Band Descriptor (LBD) based on the band representation of the Line Support Region (LSR). To uate the pairwise geometric consistencies, we define the pairwise geometric attributes between line pairs. Then we built a relational graph for candidate line matches and employ a spectral technique to solve this matching problem efficiently. The advantages of the proposed algorithm are as follows: (1) it s robust to image transformations because of the multi-scale line detection strategy (2) it s effic Platform: |
Size: 2534400 |
Author:hitxrb |
Hits:
Description: 稳定匹配问题是算法理论中的典型问题之一,稳定婚姻匹配问题则是一种解决二部图匹配问题的模型。对稳定婚姻匹配问题进行了简单的阐述,并介绍了求解典型稳定婚姻问题的Gale-Shapley算法-Stable marriage matching problem is a model to solve the problem of the two graph matching. The problem of stable marriage matching is described briefly, and the Gale-Shapley algorithm is introduced. Platform: |
Size: 27648 |
Author:陈默 |
Hits:
Description: 字符串匹配问题。输入一个字符串，程序计算出字符串里有没前后重复的部分，并输出重复的内容。-String matching problem. Enter a string, the program calculated before and after the string, there are no duplicate parts and duplicate the contents of the output. Platform: |
Size: 4096 |
Author:rean7na099 |
Hits:
Description: 二分图最佳匹配算法是通过给每个顶点一个标号来把求最大权匹配的问题转化为求完备匹配的问题的-Bipartite graph matching algorithm is optimal for each vertex by a reference to the right to seek the maximum matching problem and minimize the perfect matching problem Platform: |
Size: 1024 |
Author:刘金鑫 |
Hits:
Description: 用于计算一些条带状的影像匹配问题，可以快速的平差计算-Used to calculate the number of stripes of image matching problem, you can quickly calculate the adjustment Platform: |
Size: 8977408 |
Author:Jerry |
Hits:
Description: 基于DTW算法的孤立词语音识别,DTW（Dynamic Time Warping，动态时间归整）算法,解决发音长短不一的模板匹配问题，用于孤立词识别.-Isolated word speech recognition based on DTW algorithm.DTW (Dynamic Time Warping, dynamic time warping algorithm), solve the pronunciation of varying lengths of template matching problem for isolated word recognition. Platform: |
Size: 377856 |
Author:张盛 |
Hits:
Description: 提出一种基于DP匹配的特征矩阵相似性度量方法。首先,在对象矩阵与样本矩阵的行向量之间采用一维DP匹配方法,产生一个相似行向量来替代对象矩阵。然后再用一维DP匹配计算相似行向量与样本矩阵的标准行向量之间的匹配距离。最后在匹配距离上定义两个特征矩阵的相似度。此方法本质上是将二维特征矩阵的匹配问题转化为两个一维向量的DP匹配,适用于解决二维对象的识别和检索问题。在图像检索系统平台中对本文给出的相似性度量方法进行验证,结果表明此方法是有效的。-DP matching is proposed based on the characteristic matrix similarity measure. First, the line between the matrix and vector objects sample matrix using a one-dimensional DP matching method produces a similar row vector matrix instead of the object. Then use the one-dimensional DP matching distance calculation similar matches row vector of the sample standard matrix row vectors. The last two features define the similarity matrix in the matching distance. The matching problem is a two-dimensional matrix conversion feature of this method is essentially a two-dimensional vector of DP matching, suitable for solving the problem identification and retri of two-dimensional objects. Similarity measurement in image retri system platform for this paper to verify the results show that this method is effective. Platform: |
Size: 496640 |
Author:fangsm |
Hits:
Description: 关于间隙字符串匹配问题的程序,程序已经通过并且得到运行,-String matching problem about clearance procedures, the program has been run through and get, Platform: |
Size: 18432 |
Author:Saanrxe |
Hits:
Search - matching problem